Hanoi tower problem
英 [hæˈnɔɪ ˈtaʊə(r) ˈprɒbləm]
美 [ˈhænɔɪ ˈtaʊər ˈprɑːbləm]
【计】汉诺塔问题
双语例句
- Hanoi Tower is more classical recursion problem while designing program.
Hanoi塔是程序设计中比较经典的递归问题。 - The Recursion problem is one of the most important and difficult points in the computer programming language. This thesis takes The Hanoi tower for example to discuss how to use two-tree to work out the Recursion problem.
递归问题是计算机程序设计语言里面的一个重点，难点问题，本文以汉诺塔问题为例讨论如何用二叉树来求解递归问题。 - This paper develops non-recursive algorithmic program of Hanoi tower problem employing PAR method and the new strategy of developing loop invariant and verifies the program formally.
使用形式化方法PAR及循环不变式开发新策略，开发了Hanoi塔问题非递归算法，并对其进行了形式化的正确性证明。 - Hanoi Tower Problem is a typical recursion question, whose solution is mentioned in many books on computation, but there is little concrete realization for them.
汉诺塔问题是一个典型的递归问题，它的解法在很多计算机书中都有提到，但很少具体实现； - Solution on system of natural number of Hanoi Tower problem
梵塔问题的自然数解 - Dividing, combining and recursive method is used in this paper, solving algorithm of five-pole Hanoi tower problem is obtained.
运用分治与递归方法，得到一个求解五柱Hanoi塔问题的算法。 - Study of Hanoi Tower Problem with Multi-Pegs
多柱汉诺塔问题研究 - According to that algorithm, this article puts forward a formula to calculate the number of movements necessary for the 4-peg Hanoi Tower problem, and proves it using mathematical induction.
本文按照这种算法总结出完成四柱汉诺塔游戏之最少步数的公式，并用数学归纳法证明了它。 - A New Non-Recursive Algorithm of Hanoi Tower Problem
汉诺塔问题的非递归新解法 - Research on Five-pole Hanoi Tower Problem
五柱Hanoi塔问题研究 - On Psychological Measurement in Resolving the "Hanoi Tower" Problem for Children of 7& 16 Years Old
7～16岁学生解决汉诺塔问题的心理测试 - On the Solution to Hanoi Tower Problem Based on Assembly Language Graphics Pattern
基于汇编语言图形模式的汉诺塔问题解决方案 - A Discussion of Hanoi Tower Problem
HANOI塔问题求解 - The Implementation of Hanoi Tower 'Problem on Computer JB-3000
Hanoi塔问题在JB&3000计算机上的实现 - The solution of Hanoi Tower problem using PC assembly language
用PC汇编语言编程解决汉诺塔问题